Information Processing Ability of Binary Detectors and Block Decoders
نویسندگان
چکیده
This paper applies the concepts of information processing [1] to the study of binary detectors and block decoders in a single user digital communication system. We quantify performance in terms of the information transfer ratio γ which measures how well systems preserve discrimination information between two stochastic signals. We investigate hard decision detectors and minimum distance decoders in various additive noise environments. We show that likelihood ratio digital demodulators maximize γ.
منابع مشابه
Quad-pixel edge detection using neural network
One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...
متن کاملQuad-pixel edge detection using neural network
One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملOptimal soft decision block decoders based on fast Hadamard transform
AMrcrctAn approach for efficient utilization of fast Hadamard transform in decoding binary linear block codes is presented. Computational gain is obtained by employing various types of concurring codewords, and memory reduction is also achieved by appropriately selecting rows for the generator matix. The availability of these codewords in general, and particularly in some of the most frequently...
متن کاملLow-Density Parity-Check Codes for Data Storage and
For high density magnetic recording channels and memory systems, low-density parity-check (LDPC) codes with probabilistic decoding are replacing Reed-Solomon (RS) codes or Bose-Chaudhuri-Hocquenghem (BCH) codes with conventional algebraic decoding. The main benefit of LDPC codes over the RS and BCH codes is that LDPC codes can provide lower error probabilities than equivalent conventional codes...
متن کامل